# ballot problem

ballot problem
задача об оценке результатов баллотировки (по выборочным данным)

English-Russian dictionary of computer science and programming. 2013.

### Смотреть что такое "ballot problem" в других словарях:

• Ballot — A ballot is a device (originally a small ball see blackball) used to record choices made by voters. Each voter uses one ballot, and ballots are not shared. In the simplest elections, a ballot may be a simple scrap of paper on which each voter… …   Wikipedia

• Bertrand's ballot theorem — In combinatorics, Bertrand s ballot theorem is the solution to the question: In an election where one candidate receives p votes and the other q votes with p > q , what is the probability that the first candidate will be strictly ahead of the… …   Wikipedia

• The Ballot or the Bullet — is the name of a public speech by human rights activist Malcolm X. In the speech, which was delivered on April 3, 1964, at Cory Methodist Church in Cleveland, Ohio, [ Malcolm X Speaks , p. 23.] Malcolm advised African Americans to judiciously… …   Wikipedia

• Oregon Ballot Measure 54 (2008) — Measure 54 Standardizes Voting Eligibility For School Board Elections With Other State And Local Elections. Election results Yes or no Votes …   Wikipedia

• provisional ballot — A paper ballot used by a voter when there is some problem in establishing a voters eligibility. The ballot will be counted only if election officials determine that the person was in fact entitled to vote. Category: Small Claims Court & Lawsuits… …   Law dictionary

• Separability problem — The separability problem is a concept from the field of social choice theory that describes the situation where two or more issues up for vote on a ballot either are, or are perceived as, related. The separability problem commonly manifests… …   Wikipedia

• Catalan number — For names of numbers in Catalan, see List of numbers in various languages#Occitano Romance. In combinatorial mathematics, the Catalan numbers form a sequence of natural numbers that occur in various counting problems, often involving recursively… …   Wikipedia

• Dmitry Mirimanoff — Dmitry Semionovitch Mirimanoff (Russian: Дмитрий Семёнович Мириманов) (September 13, 1861, Pereslavl Zalessky, Russia – January 5, 1945, Geneva, Switzerland) became a doctor of mathematical sciences in 1900, in Geneva, and taught at the… …   Wikipedia

• Odds algorithm — The odds algorithm is a mathematical method for computing optimal strategies for a class of problems that belong to the domain of optimal stopping problems. Their solution follows from the odds strategy, and the importance of the odds strategy… …   Wikipedia

• Теорема Бертрана о выборах — В комбинаторике, Теорема Бертрана о выборах, названая в честь Жозефа Бертрана, который опубликовал ее в 1887 году  утверждение, доказывающее ответ на вопрос «Какова вероятность того, что на выборах с участием двух кандидатов, в которых… …   Википедия

• Dining cryptographers protocol/Rewrite — Problem Statement Dining Cryptographers A group of cryptographers is enjoying dinner at a local restaurant. Upon requesting their bill, the cryptographers are surprised to learn from their host that payment for the dinner has already been… …   Wikipedia

### Поделиться ссылкой на выделенное

##### Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»